Compression of Silhouette-like Images based on WFA
نویسندگان
چکیده
We describe a new approach to lossy compression of silhouettelike images. By a silhouette-like image we mean a bi-level image consisting of black and white regions divided by a small number of closed curves. We use a boundary detection algorithm to express the closed curves by chain codes, and we express the chains as one function of one variable. We compress this function using WFA over two letter alphabet. Finally, we use arithmetic coding to store the automaton. This work was supported by the National Science Foundation under Grant No. CCR-9417384. Preliminary version was presented in DCC 1997. Journal of Universal Computer Science, vol. 3, no. 10 (1997), 1100-1113 submitted: 11/3/97, accepted: 2/7/97, appeared: 28/10/97 Springer Pub. Co.
منابع مشابه
Asymmetric Coding in (m)-WFA Image Compression
Weighted Finite Automata (WFA) generalize nite automata by attaching real numbers as weights to states and transitions. As shown by Culik and Kari [CK93, CK95, KF94] WFA provide a powerful tool for image generation and compression. The inference algorithm for WFA subdivides an image into a set of nonoverlapping range images and then separately approximates each one with a linear combination of ...
متن کاملPlanelet Transform: A New Geometrical Wavelet for Compression of Kinect-like Depth Images
With the advent of cheap indoor RGB-D sensors, proper representation of piecewise planar depth images is crucial toward an effective compression method. Although there exist geometrical wavelets for optimal representation of piecewise constant and piecewise linear images (i.e. wedgelets and platelets), an adaptation to piecewise linear fractional functions which correspond to depth variation ov...
متن کاملOn the Basic Parameters of Automaton - Based ImageCompressionB
We will deal with 2D digital images, but the methods we employ generalise directly to any nite number of dimensions. A square digital image composed of 2 20 pixels (resolution 10) in which each pixel may assume any of 2 16 values will occupy 2 24 bits in its raw state. It is clear just from this simple example that digital images require data compression. This paper examines the theory behind t...
متن کاملBetter Compression Performance by Compressing Sliced Bit Planes of Image Using Weighted Finite Automata
Weighted Finite Automata (WFA) is an efficient structure for digital image storage and is successfully applied for the image compression purpose. This paper introduces the idea of slicing image into eight bit planes and then compressing each bit planes individually using proposed WFA inference algorithm. Furthermore, the proposed algorithm uses the concept of invertible resolution wise mapping ...
متن کاملImage Storage, Indexing and Recognition with Finite State Automata
In this paper, we introduce the weighted finite state automata (WFA) as a tool for image specification and loss or loss-free compression. We describe how to compute WFA from input images and how the resultant automaton can be used to store images (or to create image database) and to obtain additional interesting information usable for image indexing or recognition. Next, we describe an automata...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 3 شماره
صفحات -
تاریخ انتشار 1997